Perfect Coding for Dephased Quantum State Transfer

نویسنده

  • Alastair Kay
چکیده

Near-future realisations of quantum technologies, from simple state-generation tasks [1–3] to analogue quantum simulation [4], will be small scale and will rely on intrinsic properties of the system to facilitate as much of their functionality as possible, rather than trying to impose error-prone operations to strong-arm the system into performing tasks. For example, existing quantum simulators such as [5], while scaling to larger numbers of qubits, are not universal computational devices; they are Hamiltonian-based systems with some ability to tune their parameters. Other systems similarly sacrifice computational universality to achieve their ends, from quantum key distribution systems [6] to the DWave quantum computer [7], being tuned to do precisely what they need to. with minimal controls. The difficulty is that Hamiltonian evolution is not obviously compatible with future scaling ambitions. Error correction is a particular challenge given that noise, whose initial action may be well localised, rapidly evolves into potentially destructive correlated errors across an entire device. Can we guard against these effects? The question is especially pertinent when we recognise that interest quantum computers was largely spurred on by the development of a theory of error correction [8, 9]. It had previously been suggested that the continuum of possible errors would make quantum error correction vastly more challenging, if not impossible, compared to the discrete errors of classical theory. Implementation of Hamiltonian-based technologies might be similarly inhibited. In this paper, we study the error correction of one particular protocol, perfect state transfer [10–12], which is well suited to this scenario since the relevant observables will be well localised at particular times. We show that error correction is possible with remarkable efficiency by specifying perfect quantum codes, those which are maximally efficient in that every element in the state space is involved in detecting errors, massively improving the operating regime compared to the preliminary results in [13]. Perfect quantum state transfer is the process whereby an unknown quantum state is transported perfectly from one node of a network to another simply via the evolution of a time-invariant Hamiltonian, often across a one-dimensional spin chain in order to maximise the transfer distance. By suitably engineering the

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect state transfer on signed graphs

We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. First, we show that the signed join of a negative 2-clique with any positive (n, 3)-regular graph has perfect state transfer even if the unsigned join does not. Curiously, the perfect state transfer time improves as n increases. Next, we prove that a s...

متن کامل

Perfect state transfer on graphs with a potential

In this paper we study quantum state transfer (also called quantum tunneling) on graphs when there is a potential function on the vertex set. We present two main results. First, we show that for paths of length greater than three, there is no potential on the vertices of the path for which perfect state transfer between the endpoints can occur. In particular, this resolves (in the negative) a c...

متن کامل

Quantum-chemical modeling of the stacking mechanism for the 1H-4H proton transfer in pyridine derivatives. A DFT study

The stacking mechanism of the 1H-4H proton transfer in 4-pyridone, 4-pyridinthione and p-aminopyridineare constructed. For quantitative description of this process by means of the quamtumchemicalmethod density functional theory (DFT) the activation energy (

متن کامل

Perfect quantum state transfer with randomly coupled quantum chains

We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they are relatively weak (say 5%). Furthermore, we show that given a quite arbitrary pair of quantum chains, one can check whether it is capable of perfect trans...

متن کامل

Which weighted circulant networks have perfect state transfer?

The question of perfect state transfer existence in quantum spin networks based on weighted graphs has been recently presented by many authors. We give a simple condition for characterizing weighted circulant graphs allowing perfect state transfer in terms of their eigenvalues. This is done by extending the results about quantum periodicity existence in the networks obtained by Saxena, Severini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018